Directed acyclic graph

Results: 287



#Item
81Bottom-up β-reduction: uplinks and λ-DAGs∗ (extended version) Olin Shivers† Georgia Institute of Technology

Bottom-up β-reduction: uplinks and λ-DAGs∗ (extended version) Olin Shivers† Georgia Institute of Technology

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2005-04-26 17:10:34
82Mathematics / Lambda calculus / Directed acyclic graph / B-tree / Tree traversal / Tree / Free variables and bound variables / T-tree / Linked list / Graph theory / Binary trees / Computing

Bottom-up β-reduction: uplinks and λ-DAGs (journal version) June 29, 2010 Olin Shivers

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2010-07-08 22:05:21
83Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2014-04-18 22:07:45
84Longest Paths in Planar DAGs in Unambiguous Log-Space

Longest Paths in Planar DAGs in Unambiguous Log-Space

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 16:29:35
85On Models and Query Languages for Probabilistic Processes ∗ Daniel Deutch Tova Milo

On Models and Query Languages for Probabilistic Processes ∗ Daniel Deutch Tova Milo

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2010-09-30 07:59:25
86Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem

Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-03 17:31:15
87Trust-based recommendation systems: an axiomatic approach Reid Andersen∗ Abraham Flaxman∗  Christian Borgs∗

Trust-based recommendation systems: an axiomatic approach Reid Andersen∗ Abraham Flaxman∗ Christian Borgs∗

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2008-01-13 21:45:10
88Permuting Web and Social Graphs∗ Paolo Boldi Massimo Santini Sebastiano Vigna Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy Abstract Since the first investigations on web graph c

Permuting Web and Social Graphs∗ Paolo Boldi Massimo Santini Sebastiano Vigna Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy Abstract Since the first investigations on web graph c

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2010-11-11 16:59:13
89Parallelizing with BDSC, a Resource-Constrained Scheduling Algorithm for Shared and Distributed Memory Systems Dounia Khaldia,∗, Pierre Jouvelotb , Corinne Ancourtb a Department of Computer Science University of Housto

Parallelizing with BDSC, a Resource-Constrained Scheduling Algorithm for Shared and Distributed Memory Systems Dounia Khaldia,∗, Pierre Jouvelotb , Corinne Ancourtb a Department of Computer Science University of Housto

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2014-12-19 08:18:37
90Pebbling and Proofs of Work Cynthia Dwork1 , Moni Naor2? , and Hoeteck Wee3?? 1 Microsoft Research, Silicon Valley Campus,  2

Pebbling and Proofs of Work Cynthia Dwork1 , Moni Naor2? , and Hoeteck Wee3?? 1 Microsoft Research, Silicon Valley Campus, 2

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2008-09-15 04:53:13